Nuprl Lemma : sorted-by-cons 11,40

T:Type, R:(TT), x:TL:(T List).
sorted-by(R;[x / L])  (sorted-by(R;L) & (zLR(x,z))) 
latex


Definitionsf(a), x:AB(x), x:AB(x), ||as||, n+m, P  Q, False, A, P & Q, A  B, i  j < k, , {x:AB(x)} , {i..j}, Type, type List, xLP(x), a < b, xt(x), t  T, s = t, , Void, x:A  B(x), (x  l), x.A(x), l[i], A List, [car / cdr], #$n, P  Q, P  Q, sorted-by(R;L), n - m, , T, True, hd(l), i <z j, i j, |g|, S  T, A c B, x:AB(x), SQType(T), s ~ t, {T}, left + right, P  Q, Dec(P), Atom, , b, x,y:A//B(x;y), b | a, a ~ b, |p|, a  b, a <p b, a < b, x f y, |r|, (xL.P(x)), Unit, , -n
Lemmasselect member, true wf, decidable int equal, guard wf, squash wf, nat wf, member wf, le wf, iff wf, rev implies wf, select cons tl, length wf1, int seg wf, select wf, l all wf2, l member wf, l all wf

origin